On the generalized obnoxious center problem: antimedian subsets∗
نویسندگان
چکیده
The set of vertices that maximize (minimize) the remoteness is the antimedian (median) set of the profile. It is proved that for an arbitrary graph G and S ⊆ V (G) it can be decided in polynomial time whether S is the antimedian set of some profile. Graphs in which every antimedian set is connected are also considered.
منابع مشابه
Axiomatic Characterization of the Median and Antimedian Functions on Cocktail-Party Graphs and Complete Graphs
A median (antimedian) of a profile of vertices on a graph G is a vertex that minimizes (maximizes) the remoteness value, that is, the sum of the distances to the elements in the profile. The median (or antimedian) function has as output the set of medians (antimedians) of a profile. It is one of the basic models for the location of a desirable (or obnoxious) facility in a network. The median fu...
متن کاملAxiomatic Characterization of the antimedian Function on Paths and Hypercubes
An antimedian of a profile π = (x1, x2, . . . , xk) of vertices of a graph G is a vertex maximizing the sum of the distances to the elements of the profile. The antimedian function is defined on the set of all profiles on G and has as output the set of antimedians of a profile. It is a typical location function for finding a location for an obnoxious facility. The ‘converse’ of the antimedian f...
متن کاملAxiomatic characterization of the median and antimedian function on a complete graph minus a matching
A median (antimedian) of a profile of vertices on a graph G is a vertex that minimizes (maximizes) the sum of the distances to the elements in the profile. The median (antimedian) function has as output the set of medians (antimedians) of a profile. It is one of the basic models for the location of a desirable (obnoxious) facility in a network. The median function is well studied. For instance ...
متن کاملAlgorithm for Obnoxious Facility Location Problem
This study presents an endeavor to determine an optimal solution for the obnoxious facility location problem. Obnoxious materials are those which may cause harm to the health of human beings and pollute the environment. The obnoxious material management is a significant environmental issue. Since the social economical growth encourages to establishment of industrialization. While the waste mate...
متن کاملThe Obnoxious Center Problem on a Tree
The obnoxious center problem in a graph G asks for a location on an edge of the graph such that the minimum weighted distance from this point to a vertex of the graph is as large as possible. We derive algorithms with linear running time for the cases when G is a path or a star, thus improving previous results of Tamir. For subdivided stars we present an algorithm of running time O(n log n). Fo...
متن کامل